منابع مشابه
Constructive mathematics without choice
What becomes of constructive constructive mathematics without the axiom of (countable) choice? Using illustrations from a variety of areas, it is argued that it becomes better. Despite the apparent unanimity among schools of constructive mathematics with respect to the acceptance of the countable axiom of choice, I believe it to be one of the central problems, or mysteries, of constructive math...
متن کاملMathematics is painting without the brush; painting is mathematics without the chalk
Although at a superficial level mathematics and painting may be perceived as of very different nature, they are profoundly similar at a deep conceptual and functional level. The similarity goes far beyond immediate relationships such as the fact that geometry plays a significant role in both disciplines. The deep and significant kinship between math and painting becomes evident, when one consid...
متن کاملDecidability and complexity of fibred logics without shared connectives
Fibring is a powerful mechanism for combining logics, and an essential tool for designing and understanding complex logical systems. Abstract results about the semantics and proof-theory of fibred logics have been extensively developed, including general preservation results for metalogical properties like soundness and (sufficient conditions for) completeness. Decidability, however, a key ingr...
متن کاملNothing in Biology makes Sense without the Flavour of Mathematics
The elements of mathematical language are on the whole precise and unambigous. In the history of science, one can see that the development of any branch of science begins from the largely descriptive, goes on to become explanatory at the qualitative level, and finally becomes explanatory at the quantitative level. With the application of mathematical principles, physics made the transition from...
متن کاملAutomatic Decidability
We give a set of inference rules with constant constraints. Then we show how to extend a set of equational clauses, so that if the application of these inference rules halts on these clauses, then the theory is decidable by applying a standard set of Paramodulation inference rules. In addition, we can determine the number of clauses generated in this decision procedure. For some theories, such ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2004
ISSN: 0168-0072
DOI: 10.1016/j.apal.2003.11.029